Surfing the Internet-of-Things: lightweight access and control of wireless sensor networks using industrial low power protocols

Internet-of-Things (IoT) is emerging to play an important role in the continued advancement of information and communication technologies. To accelerate industrial application developments, the use of web services for networking applications is seen as important in IoT communications. In this paper, we present a RESTful web service architecture for energy-constrained wireless sensor networks (WSNs) to enable remote data collection from sensor devices in WSN nodes. Specifically, we consider both IPv6 protocol support in WSN nodes as well as an integrated gateway solution to allow any Internet clients to access these nodes.We describe the implementation of a prototype system, which demonstrates the proposed RESTful approach to collect sensing data from a WSN. A performance evaluation is presented to illustrate the simplicity and efficiency of our proposed scheme

Recent advances in industrial wireless sensor networks towards efficient management in IoT

With the accelerated development of Internet-of- Things (IoT), wireless sensor networks (WSN) are gaining importance in the continued advancement of information and communication technologies, and have been connected and integrated with Internet in vast industrial applications. However, given the fact that most wireless sensor devices are resource constrained and operate on batteries, the communication overhead and power consumption are therefore important issues for wireless sensor networks design. In order to efficiently manage these wireless sensor devices in a unified manner, the industrial authorities should be able to provide a network infrastructure supporting various WSN applications and services that facilitate the management of sensor-equipped real-world entities. This paper presents an overview of industrial ecosystem, technical architecture, industrial device management standards and our latest research activity in developing a WSN management system. The key approach to enable efficient and reliable management of WSN within such an infrastructure is a cross layer design of lightweight and cloud-based RESTful web service

Towards offering more useful data reliably to mobile cloudfrom wireless sensor network

The integration of ubiquitous wireless sensor network (WSN) and powerful mobile cloud computing (MCC) is a research topic that is attracting growing interest in both academia and industry. In this new paradigm, WSN provides data to the cloud, and mobile users request data from the cloud. To support applications involving WSN-MCC integration, which need to reliably offer data that are more useful to the mobile users from WSN to cloud, this paper first identifies the critical issues that affect the usefulness of sensory data and the reliability of WSN, then proposes a novel WSN-MCC integration scheme named TPSS, which consists of two main parts: 1) TPSDT (Time and Priority based Selective Data Transmission) for WSN gateway to selectively transmit sensory data that are more useful to the cloud, considering the time and priority features of the data requested by the mobile user; 2) PSS (Priority-based Sleep Scheduling) algorithm for WSN to save energy consumption so that it can gather and transmit data in a more reliable way. Analytical and experimental results demonstrate the effectiveness of TPSS in improving usefulness of sensory data and reliability of WSN for WSN-MCC integration

A short review on sleep scheduling mechanism in wireless sensor networks

Sleep scheduling, also known as duty cycling, which turn- s sensor nodes on and off in the necessary time, is a common train of thought to save energy. Sleep scheduling has become a significant mech- anism to prolong the lifetime of WSNs and many related methods have been proposed in recent years, which have diverse emphases and appli- cation areas. This paper classifies those methods in different taxonomies and provides a deep insight into them

Open triple-branched stent graft applied to patient of acute type a aortic dissection with Aberrant Right Subclavian Artery

A 57-year-old Chinese male patient presented with Standford type A aortic dissection with an aberrant right subclavian artery (ARSA). At operation, the ascending aorta was replaced by a mono–branch vascular prosthesis with the branch bypassing to the ARSA; the triple-branched stent graft was inserted into the true lumen of the arch and proximal descending aorta (covering the origin of the ARSA) with each sidearm graft being positioned into the aortic branches; and then its proximal end was sutured to mono–branched vascular prosthesis. Follow-up computed tomography angiography showed false lumen of the dissection disappeared with satisfactory position of the triple-branched stent graft

Geographic routing in duty-cycled industrial wireless sensor networks with radio irregularity

Industrial wireless sensor networks (IWSNs) are required to provide highly reliable and real-time transmission. Moreover, for connected K-neighborhood (CKN) sleep scheduling-based duty-cycled IWSNs in which the network lifetime of IWSNs can be prolonged, the two-phase geographic greedy forwarding (TPGF) geographic routing algorithm has attracted attention due to its unique transmission features: multi path, shortest path, and hole bypassing. However, the performance of TPGF in CKN-based duty-cycled IWSNs with radio irregularity is not well investigated in the literature. In this paper, we first evaluate the impact of radio irregularity on CKN-based duty-cycled IWSNs. Furthermore, we investigate the routing performance of TPGF in CKN-based duty-cycled IWSNs with radio irregularity, in terms of the number of explored routing paths as well as the lengths of the average and shortest routing paths. Particularly, we establish the upper bound on the number of explored routing paths. The upper bound is slightly relaxed with radio irregularity compared with without radio irregularity; however, it is bounded by the number of average 1-hop neighbors in always-on IWSNs. With extensive simulations, we observe that the cross-layer optimized version of TPGF (i.e., TPFGPlus) finds reliable transmission paths with low end-to-end delay, even in CKN-based duty-cycled IWSNs with radio irregularity

Releasing network isolation problem in group-based industrial wireless sensor networks

In this paper, we propose a cross-layer optimization scheme named Adjusting the Transmission Radius (ATR), which is based on the Energy Consumed uniformly Connected K-Neighborhood (EC-CKN) sleep scheduling algorithm in wireless sensor networks (WSNs). In particular, we discovered two important problems, namely, the death acceleration problem and the network isolation problem, in EC-CKN-based WSNs. Furthermore, we solve these two problems in ATR, which creates sleeping opportunities for the nodes that cannot get a chance to sleep in the EC-CKN algorithm. Simulation and experimental results show that the network lifetime of ATR-Connected-K-Neighborhood-based WSNs increases by 19%, on average, and the maximum increment is 41%. In addition, four important insights were discovered through this research work and presented in this paper

A multi-objective optimization scheduling method based on the ant colony algorithm in cloud computing

Abstract: For task-scheduling problems in cloud computing, a multi-objective optimization method is proposed here. First, with an aim toward the biodiversity of resources and tasks in cloud computing, we propose a resource cost model that defines the demand of tasks on resources with more details. This model reflects the relationship between the user's resource costs and the budget costs. A multi-objective optimization scheduling method has been proposed based on this resource cost model. This method considers the makespan and the user's budget costs as constraints of the optimization problem, achieving multi-objective optimization of both performance and cost. An improved ant colony algorithm has been proposed to solve this problem. Two constraint functions were used to evaluate and provide feedback regarding the performance and budget cost. These two constraint functions made the algorithm adjust the quality of the solution in a timely manner based on feedback in order to achieve the optimal solution. Some simulation experiments were designed to evaluate this method's performance using four metrics: 1) the makespan; 2) cost; 3) deadline violation rate; and 4) resource utilization. Experimental results show that based on these four metrics, a multi-objective optimization method is better than other similar methods, especially as it increased 56.6% in the best case scenario

A multiqueue interlacing peak scheduling method based on tasks’ classification in cloud computing

In cloud computing, resources are dynamic, and the demands placed on the resources allocated to a particular task are diverse. These factors could lead to load imbalances, which affect scheduling efficiency and resource utilization. A scheduling method called interlacing peak is proposed. First, the resource load information, such as CPU, I/O, and memory usage, is periodically collected and updated, and the task information regarding CPU, I/O, and memory is collected. Second, resources are sorted into three queues according to the loads of the CPU, I/O, and memory: CPU intensive, I/O intensive, and memory intensive, according to their demands for resources. Finally, once the tasks have been scheduled, they need to interlace the resource load peak. Some types of tasks need to be matched with the resources whose loads correspond to a lighter types of tasks. In other words, CPU-intensive tasks should be matched with resources with low CPU utilization; I/O-intensive tasks should be matched with resources with shorter I/O wait times; and memory-intensive tasks should be matched with resources that have low memory usage. The effectiveness of this method is proved from the theoretical point of view. It has also been proven to be less complex in regard to time and place. Four experiments were designed to verify the performance of this method. Experiments leverage four metrics: 1) average response time; 2) load balancing; 3) deadline violation rates; and 4) resource utilization. The experimental results show that this method can balance loads and improve the effects of resource allocation and utilization effectively. This is especially true when resources are limited. In this way, many tasks will compete for the same resources. However, this method shows advantage over other similar standard algorithms

A scheme on indoor tracking of ship dynamic positioning based on distributed multi-sensor data fusion

Investigating the model ship dynamic positioning system by simulating the actual sea conditions in the laboratory can not only avoid the risks caused by the directly experiments on a true ship, but also reduce the costs. With the purpose of realizing the high accuracy control of the dynamic positioning, besides a high accuracy mathematical model of the ship, an important condition is that the position information provided by the position detection system must be accurate, reliable and continuous. The global positioning system (GPS) signal is restricted when the model ship dynamic positioning system is set indoors. This paper describes a novel scheme for ship target tracking based on the multi-sensor data fusion techniques. To improve the accuracy of indoor positioning and ship target tracking, the characteristics of many sensors are systematically analyzed, such as radar, difference global positioning system (DGPS) and ultrasonic sensors. Other important factors, including the indoor temperature, position and environment, are also taken into account to further optimize the performance. Combining the Kalman filter method, the time alignment method, the coordinate transformation method and the optimal fusion criterion method, the core algorithm of our framework employs the track correlation as the performance index of the optimal fusion. The experimental results indicate that our method outperforms the methods based on a single ultrasonic sensor. The maximum error between the estimated location and the real location is only 1.32 cm, which meets the standard for engineering applications